On Stackelberg Mixed Strategies

نویسنده

  • Vincent Conitzer
چکیده

It is sometimes the case that one solution concept in game theory is equivalent to applying another solution concept to a modified version of the game. In such cases, does it make sense to study the former separately (as it applies to the original representation of the game), or should we entirely subordinate it to the latter? The answer probably depends on the particular circumstances, and indeed the literature takes different approaches in different cases. In this article, I consider the specific example of Stackelberg mixed strategies. I argue that, even though a Stackelberg mixed strategy can also be seen as a subgame perfect Nash equilibrium of a corresponding extensive-form game, there remains significant value in studying it separately. The analysis of this special case may have implications for other solution concepts. Vincent Conitzer Duke University E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Should Stackelberg Mixed Strategies Be Considered a Separate Solution Concept?

It is sometimes the case that one solution concept in game theory is equivalent to applying another solution concept to a modified version of the game. In such cases, does it make sense to think of the former as a truly separate solution concept, or should we entirely subordinate it to the latter? The answer probably depends on the particular circumstances, and indeed the literature takes diffe...

متن کامل

Security Games with Multiple Attacker Resources

Algorithms for finding game-theoretic solutions are now used in several real-world security applications. This work has generally assumed a Stackelberg model where the defender commits to a mixed strategy first. In general two-player normal-form games, Stackelberg strategies are easier to compute than Nash equilibria, though it has recently been shown that in many security games, Stackelberg st...

متن کامل

Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games

Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los Angeles International Airport. These algorithms assume that the defender (security personnel) can commit to a mixed strategy, a so-called Stackelberg model. As pointed out by Kiekintveld et al. (2009), in these applicati...

متن کامل

A mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach

One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...

متن کامل

Fighting m-criminals with Bayesian Stackelberg games

Bayesian Stackelberg games have been used to compute optimal patrol strategies for the security of the Los Angeles International Airport (LAX) by modelling the security situation as a 1-leader, 1-follower, Bayesian game where there is one leader type and an arbitrary number of follower types. A previous approach, named DOBSS, computes the Stackelberg solution for this game by solving a Mixed In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Synthese

دوره 193  شماره 

صفحات  -

تاریخ انتشار 2016